328 research outputs found
Report on the 6th ADBIS’2002 conference
The 6th East European Conference ADBIS 2002 was held on September~8--11, 2002 in Bratislava, Slovakia. It was organised by the Slovak University of Technology (and, in particular, its Faculty of Electrical Engineering and Information Technology) in Bratislava in co-operation with the ACM SIGMOD, the Moscow ACM SIGMOD Chapter, and Slovak Society for Computer Science. The call for papers attracted 115 submissions from 35~countries. The international program committee, consisting of 43 researchers from 21 countries, selected 25 full papers and 4 short papers for a monograph volume published by the Springer Verlag. Beside those 29 regular papers, the volume includes also 3 invited papers presented at the Conference as invited lectures. Additionally, 20 papers have been selected for the Research communications volume. The authors of accepted papers come from 22~countries of 4 continents, indicating the truly international recognition of the ADBIS conference series. The conference had 104 registered participants from 22~countries and included invited lectures, tutorials, and regular sessions. This report describes the goals of the conference and summarizes the issues discussed during the sessions
A bi-objective cost model for optimizing database queries in a multi-cloud environment
AbstractCost models are broadly used in query processing to drive the query optimization process, accurately predict the query execution time, schedule database query tasks, apply admission control and derive resource requirements to name a few applications. The main role of cost models is to estimate the time needed to run the query on a specific machine. In a multi-cloud environment, cost models should be easily calibrated for a wide range of different physical machines, and time estimates need to be complemented with monetary cost information, since both the economic cost and the performance are of primary importance. This work aims to serve as the first proposal for a bi-objective query cost model suitable for queries executed over resources provided by potentially multiple cloud providers. We leverage existing calibrating modeling techniques for time estimates and we couple such estimates with monetary cost information covering the main charging options for using cloud resources. Moreover, we explain how the cost model can become part of an optimizer. Our approach is applicable to more generic data flow graphs, the execution plans of which do not necessarily comprise relational operators. Finally, we give a concrete example about the usage of our proposal and we validate its accuracy through real case studies
RELINE: Point-of-Interest Recommendations using Multiple Network Embeddings
The rapid growth of users' involvement in Location-Based Social Networks
(LBSNs) has led to the expeditious growth of the data on a global scale. The
need of accessing and retrieving relevant information close to users'
preferences is an open problem which continuously raises new challenges for
recommendation systems. The exploitation of Points-of-Interest (POIs)
recommendation by existing models is inadequate due to the sparsity and the
cold start problems. To overcome these problems many models were proposed in
the literature, but most of them ignore important factors such as: geographical
proximity, social influence, or temporal and preference dynamics, which tackle
their accuracy while personalize their recommendations. In this work, we
investigate these problems and present a unified model that jointly learns
users and POI dynamics. Our proposal is termed RELINE (REcommendations with
muLtIple Network Embeddings). More specifically, RELINE captures: i) the
social, ii) the geographical, iii) the temporal influence, and iv) the users'
preference dynamics, by embedding eight relational graphs into one shared
latent space. We have evaluated our approach against state-of-the-art methods
with three large real-world datasets in terms of accuracy. Additionally, we
have examined the effectiveness of our approach against the cold-start problem.
Performance evaluation results demonstrate that significant performance
improvement is achieved in comparison to existing state-of-the-art methods
An Efficient Algorithm for Bulk-Loading xBR+ -trees
A major part of the interface to a database is made up of the queries that can be addressed to this database and answered (processed) in an efficient way, contributing to the quality of the developed software. Efficiently processed spatial queries constitute a fundamental part of the interface to spatial databases due to the wide area of applications that may address such queries, like geographical information systems (GIS), location-based services, computer visualization, automated mapping, facilities management, etc. Another important capability of the interface to a spatial database is to offer the creation of efficient index structures to speed up spatial query processing. The xBR + -tree is a balanced disk-resident quadtree-based index structure for point data, which is very efficient for processing such queries. Bulk-loading refers to the process of creating an index from scratch, when the dataset to be indexed is available beforehand, instead of creating the index gradually (and more slowly), when the dataset elements are inserted one-by-one. In this paper, we present an algorithm for bulk-loading xBR + -trees for big datasets residing on disk, using a limited amount of main memory. The resulting tree is not only built fast, but exhibits high performance in processing a broad range of spatial queries, where one or two datasets are involved. To justify these characteristics, using real and artificial datasets of various cardinalities, first, we present an experimental comparison of this algorithm vs. a previous version of the same algorithm and STR, a popular algorithm of bulk-loading R-trees, regarding tree creation time and the characteristics of the trees created, and second, we experimentally compare the query efficiency of bulk-loaded xBR + -trees vs. bulk-loaded R-trees, regarding I/O and execution time. Thus, this paper contributes to the implementation of spatial database interfaces and the efficient storage organization for big spatial data management
- …